Peak power modeling for join algorithms in DBMS

Tree Awareness for Relational DBMS Kernels: Staircase Join

Towards an Energy Aware DBMS - Energy Consumptions of Sorting and Join Algorithms

Database management systems comprise various algorithms for efficiently retrieving and managing data. Typically, algorithm efficiency or performance is correlated with execution speed. However, the uptime of batterypowered mobileand embedded systems strongly depends on the energy consumption of the involved components. This paper reports our results concerning the energy consumption of differen...

Efficient Outer Join Data Skew Handling in Parallel DBMS

Large enterprises have been relying on parallel database management systems (PDBMS) to process their ever-increasing data volume and complex queries. The scalability and performance of a PDBMS comes from load balancing on all nodes in the system. Skewed processing will significantly slow down query response time and degrade the overall system performance. Business intelligence tools used by ent...

Modeling Histories in Object DBMS ?

Temporal DBMS ooer concepts and functionalities related to data timestamping and history management. Analyzing the numerous approaches in this eld demonstrate a signiicant lack of uniication of the main results, thus postponing the emergence of commercial products. This problem is about to be solved for the relational approach, e.g. through the deenition of the TSQL2 language. However, there is...

Research Report Join Algorithms for Online Aggregation Limited Distribution Notice Join Algorithms for Online Aggregation

This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and speciic requests. After outside...